Zeckendorf representation of multiplicative inverses modulo a Fibonacci number

نویسندگان

چکیده

Abstract Prempreesuk, Noppakaew, and Pongsriiam determined the Zeckendorf representation of multiplicative inverse 2 modulo $$F_n$$ F n , for every positive integer n not divisible by 3, where denotes th Fibonacci number. We determine a fixed $$a \ge 3$$ a ≥ 3 all integers with $$\gcd (a, F_n) = 1$$ gcd ( , ) = 1 . Our proof makes use so-called base- $$\varphi $$ φ expansion real numbers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Newton-Raphson iteration for multiplicative inverses modulo prime powers

We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over p-adic numbers gives a recurrence relation computing modular inverse modulo p, that is logarithmic in m. We solve the recurrence to obtain an explicit formula for the inverse. Then we study different implementation variants of this iteration and show that our explicit formula is interesting for small...

متن کامل

Lookup Structures for Multiplicative Inverses Modulo 2 k

We introduce an inheritance property and related table lookup structures applicable to simplified evaluation of the modular operations “multiplicative inverse”, “discrete log”, and “exponential residue” in the particular modulus 2. Regarding applications, we describe an integer representation system of Benschop for transforming integer multiplications into additions which benefits from our tabl...

متن کامل

A Note on Fibonacci Trees and the Zeckendorf Representation of Integers

The Fibonacci numbers are defined, as usual9 by the recurrence F0 = 0, F1 = 1, Fk = Fk_x +Fk.z, k> 1. The Fibonacci tree of order k, denoted Tk, can be constructed inductively as follows: If k = 0 or k = 1, the tree is simply the root 0. If k > 15 the root is Fk ; the left subtree is Tjc_1; and the right subtree is Tk_2 with all node numbers increased by Fk . TG is shown in Figure 1. For an ele...

متن کامل

Counting Bits with Fibonacci and Zeckendorf

Fibonacci numbers and difference equations show up in many counting problems. Zeckendorf showed how to represent natural numbers in “binary” Fibonacci bases. Capocelli counted the number of 0 bits and 1 bits in such representation. Here we use the theory of difference equations to try to provide proofs for Capocelli’s claims. We also investigate generalization of the Fibonacci difference equati...

متن کامل

On Pascal’s Triangle modulo 2 in Fibonacci Representation

In the present paper we consider an analogous problem, but instead of using the binary number system as Hewgill did, we interpret every second row of modulo 2 reduced Pascal’s triangle in the Fibonacci number system. Moreover, we are interested about the whole family of sequences where the even indexed rows specify the most significant digits (“fibits”) of the Zeckendorf expansion of an integer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monatshefte für Mathematik

سال: 2022

ISSN: ['0026-9255', '1436-5081']

DOI: https://doi.org/10.1007/s00605-022-01724-y